A class of perfect graphs containing P6
نویسندگان
چکیده
Let P6 denote the induced path on six nodes. We prove that if a perfect graph G contains P6 as an induced subgraph but not two families introduced by Conforti and Cornuéjols then G is bipartite or disconnected, or % G has a star cutset. r 2002 Elsevier Science (USA). All rights reserved.
منابع مشابه
On 4-critical t-perfect graphs
It is an open question whether the chromatic number of t-perfect graphs is bounded by a constant. The largest known value for this parameter is 4, and the only example of a 4-critical t-perfect graph, due to Laurent and Seymour, is the complement of the line graph of the prism Π (a graph is 4-critical if it has chromatic number 4 and all its proper induced subgraphs are 3-colorable). In this pa...
متن کاملEfficient Domination for Some Subclasses of P_6 -free Graphs in Polynomial Time
Let G be a finite undirected graph. A vertex dominates itself and all its neighbors in G. A vertex set D is an efficient dominating set (e.d. for short) of G if every vertex of G is dominated by exactly one vertex of D. The Efficient Domination (ED) problem, which asks for the existence of an e.d. in G, is known to be NP-complete even for very restricted graph classes such as P7-free chordal gr...
متن کامل4-colorability of P6-free graphs
In this paper we will study the complexity of 4-colorability in subclasses of P6-free graphs. The well known k-colorability problem is NP -complete. It has been shown that if k-colorability is solvable in polynomial time for an induced H-free graph, then every component of H is a path. Recently, Huang [11] has shown several improved complexity results on k-coloring Pt-free graphs, where Pt is a...
متن کاملIndependent sets in (P6, diamond)-free graphs
An independent set (or a stable set) in a graph G is a subset of pairwise nonadjacent vertices of G. An independent set of G is maximal if it is not properly contained in any other independent set of G. The Maximum-Weight Independent Set (WIS) problem is the following: Given a graphG = (V,E) and a weight function w on V , determine an independent set of G of maximum weight. Let αw(G) denote the...
متن کاملWeighted independent sets in a subclass of P6-free graphs
TheMaximum Weight Independent Set (MWIS) problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. The complexity of the MWIS problem for P6-free graphs is unknown. In this note, we show that the MWIS problem can be solved in time O(nm) for (P6, banner)-free graphs by analyzing the structure of subclasses of these class of graphs. This extend...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 87 شماره
صفحات -
تاریخ انتشار 2003